#include "BinarySearchTree.h"

int main(int argc, char* argv[])
{
  //测试BinaryTree构造函数/insert/inorder_walk/successor;
    BinaryTree<int> A;
    A.insert(6);
    A.insert(3);
    A.insert(9);
    A.insert(1);
    A.insert(2);
    A.insert(7);
    A.insert(11);
    A.inorder_walk();
    A.test_successor();
    A.tree_search(6,A.get_root());
    A.tree_search(12,A.get_root());

    return 0;
};
